Watertight and 2-manifold Surface Meshes Using Dual Contouring with Tetrahedral Decomposition of Grid Cubes
نویسندگان
چکیده
منابع مشابه
Watertight and 2-Manifold Surface Meshes Using Dual Contouring With Tetrahedral Decomposition of Grid Cubes
The Dual Contouring algorithm (DC) is a grid-based process used to generate surface meshes from volumetric data. The advantage of DC is that it can reproduce sharp features by inserting vertices anywhere inside the grid cube, as opposed to the Marching Cubes (MC) algorithm that can insert vertices only on the grid edges. However, DC is unable to guarantee 2-manifold and watertight meshes due to...
متن کاملRobust Watertight Manifold Surface Generation Method for ShapeNet Models
In this paper, we describe a robust algorithm for 2-Manifold generation of various kinds of ShapeNet Models. The input of our pipeline is a triangle mesh, with a set of vertices and triangular faces. The output of our pipeline is a 2-Manifold with vertices roughly uniformly distributed on the geometry surface. Our algorithm uses an octree [Meagher 1982] to represent the original mesh, and const...
متن کاملLocally Adapted Tetrahedral Meshes Using Bisection
We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The algorithm is based on bisection of tetrahedra. A new data structure is introduced, which simplifies both the selection of the refinement edge of a tetrahedron and the recursive refinement to conformity of a mesh once some tetrahedra have been bisected. We prove that repeated application of the algo...
متن کاملConsistent Mesh Partitioning using Tetrahedral Meshes
This thesis presents partitioning techniques which classify a volumetric mesh into difierent regions while preserving the mesh connectivity (consistency). A mesh is partitioned by applying a plane partitioning technique which is geometrically exact, and a novel approach for approximate partitioning where triangular surface meshes are used as partitioning shapes. In both methods, the propagation...
متن کاملFast Relabeling of Deformable Delaunay Tetrahedral Meshes Using a Compact Uniform Grid
Fast Relabeling of Deformable Delaunay Tetrahedral Meshes Using a Compact Uniform Grid David C. Frogley Department of Computer Science, BYU Master of Science We address the problem of fast relabeling of deformable Delaunay tetrahedral meshes using a compact uniform grid, with CPU parallelization through OpenMP. This problem is important in visualizing the simulation of deformable objects and ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2016
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2016.11.037